Availability Evaluation of Quorum-Based Mutual Exclusion Schemes in General Topology Networks

نویسندگان

  • Tatsuhiro Tsuchiya
  • Tohru Kikuno
چکیده

The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. In this paper, we propose a new availability evaluation method for quorum-based mutual exclusion schemes in the presence of failures. Most of the previously proposed methods take neither the topology of systems nor link failures into consideration, and exhaustive state enumeration has been the only approach that can deal with them so far. By incorporating a notion called Minimal Quorum Spanning Trees, this method can efficiently evaluate the availability of quorum-based mutual exclusion schemes in general topology networks with unreliable nodes and links. Through experimental results, we show the superiority of the proposed method over exhaustive state enumeration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Obtaining Optimal Coteries that Maximize Availability in General Topology Networks

We discuss availability optimization of quorum-based mutual exclusion mechanisms in unreliable networks. The availability of such a mechanism depends critically on the coterie (a set of node groups called quorums) that the mechanism adopts. Previously, an integerprogramming approach was proposed for obtaining optimal coteries that maximize availability. However, this approach cannot be applied ...

متن کامل

Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes

ÐThe use of quorums is a well-known approach to achieving mutual exclusion in distributed computing systems. This approach works based on a coterie, a special set of node groups where any pair of the node groups shares at least one common node. Each node group in a coterie is called a quorum. Mutual exclusion is ensured by imposing that a node gets consensus from all nodes in at least one of th...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

Delay - Optimal Quorum Consensus

Given a set of nodes S, a coterie is a set of pairwise intersecting subsets of S. Each element in a coterie is called a quorum. Mutual exclusion in a distributed system can be achieved if each request is required to get consensus from a quorum of nodes. This technique of quorum consensus is also used for replicated distributed database systems, and bicoteries and wr-coteries have been deened to...

متن کامل

Optimal Availability Quorum Systems: Theory and Practice

Quorum systems serve as a basic tool providing a uniform and reliable way to achieve coordination in a distributed system. They are useful for distributed and replicated databases, name servers, mutual exclusion, and distributed access control and signatures. The un-availability of a quorum system is the probability of the event that no live quorum exists in the system. When such an event occur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. J.

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1999